Self-Organizing Hierarchical Cluster Timestamps
نویسندگان
چکیده
Distributed-system observation tools require an efficient data structure to store and query the partial-order of execution. Such data structures typically use vector timestamps to efficiently answer precedence queries. Many current vector-timestamp algorithms either have a poor time/space complexity tradeoff or are static. This limits the scalability of such observation tools. One algorithm, centralized hierarchical cluster timestamps, has potentially a good time/space tradeoff provided that the clusters accurately capture communication locality. However, that algorithm, as described, uses pre-determined, contiguous clusters. In this paper we extend that algorithm to enable a dynamic selection of clusters. We present experimental results that demonstrate that our extension is more stable with cluster size and provides timestamps whose average size is consistently superior to the pre-determined cluster approach.
منابع مشابه
Object Recovery Using Hierarchical Self-Organizing Maps
The self-organizing map’s unsupervised clustering property, is known for classifying high dimensional data sets into clusters that have similar features. Using this property and arranging self-organizing maps into hierarchies, we demonstrate in this paper that legacy code can be potentially broken down into suggested classes using hierarchical self-organizing maps. This is in conjunction with i...
متن کاملWeb Document Clustering based on a Hierarchical Self-Organizing Model
In this work, a hierarchical self-organizing model based on the GHSOM is presented in order to cluster web contents. The GHSOM is an artificial neural network that has been widely used for data clustering. The hierarchical architecture of the GHSOM is more flexible than a single SOM since it is adapted to input data, mirroring inherent hierarchical relations among them. The adaptation process o...
متن کاملGenerating Concept Trees from Dynamic Self-organizing Map
Self-organizing map (SOM) provides both clustering and visualization capabilities in mining data. Dynamic self-organizing maps such as Growing Self-organizing Map (GSOM) has been developed to overcome the problem of fixed structure in SOM to enable better representation of the discovered patterns. However, in mining large datasets or historical data the hierarchical structure of the data is als...
متن کاملA hierarchical self-organizing feature map for analysis of not well separable clusters of different feature density
This paper introduces a hierarchical Self-Organizing Feature Map (SOFM). The partial maps consist of individual numbers of neurons, which makes a cluster analysis with di erent degrees of resolution possible. A de nition of a special Mahalanobis space of the data set during the learning improves the properties concerning clusters with low density.
متن کاملGrowing Self Organising Map Based Exploratory Analysis of Text Data
Textual data plays an important role in the modern world. The possibilities of applying data mining techniques to uncover hidden information present in large volumes of text collections is immense. The Growing Self Organizing Map (GSOM) is a highly successful member of the Self Organising Map family and has been used as a clustering and visualisation tool across wide range of disciplines to dis...
متن کامل